Collusion in Unrepeated, First-Price Auctions with an Uncertain Number of Participants
نویسندگان
چکیده
We introduce a class of mechanisms, called bidding clubs, that allow agents to coordinate their bidding in auctions. Bidding clubs invite a set of agents to join, and each invited agent freely chooses whether to accept the invitation or whether to participate independently in the auction. Agents who join a bidding club first conduct a “pre-auction” within the club; depending on the outcome of the pre-auction some subset of the members of the club bid in the primary auction in a prescribed way. We model this setting as a Bayesian game, including agents’ choices of whether or not to accept a bidding club’s invitation. After describing this general setting, we examine the specific case of bidding clubs for first-price auctions. We show the existence of a Bayes-Nash equilibrium where agents choose to participate in bidding clubs when invited and truthfully declare their valuations to the coordinator. Furthermore, we show that the existence of bidding clubs benefits all agents (including both agent inside and outside of a bidding club) in several different senses.
منابع مشابه
How to Eliminate Collusion in Tenders and Auctions, using Game Theory (Determination of Ceiling and Floor Prices)
Governments and firms in accordance to their duties, obliged to inevitably contracts with Individuals and legal entities, especially in auction and tender process. Since, the law of conducting tenders and auctions is lacking efficiency and has major objection, therefore, this has led to the dissemination and development of areas of corruption in these contracts (through collusion). In this pape...
متن کاملAuction Mechanisms and Bidder Collusion: Bribes, Signals and Selection
The theoretical literature on collusion in auctions suggests that the first-price mechanism can deter the formation of bidding rings. In equilibrium, collusive negotiations are either successful or are avoided altogether, hence such analysis neglects the effects of failed collusion attempts. In such contingencies, information revealed in the negotiation process is likely to affect the bidding b...
متن کاملCollusion through communication in auctions
We study the extent to which communication can serve as a collusion device in one-shot firstand second-price sealed-bid auctions. Theoretically, second-price auctions are more fragile to collusion through communication than first-price auctions. In an array of laboratory experiments we vary the amount of interactions (communication and/or transfers without commitment) available to bidders. We f...
متن کاملLinear Programming for Mechanism Design: An Application to Bidder Collusion at First-Price Auctions
We demonstrate the use of linear programming techniques in the analysis of mechanism design problems. We use these techniques to analyze the extent to which a rst-price auction is robust to collusion when, contrary to some prior literature on collusion at rst-price auctions, the cartel cannot prevent its members from bidding at the auction. In this case, cartels have been shown to be less pro...
متن کاملCollusion in private value ascending price auctions
We investigate the effects of bid improvement rules and bidder value asymmetry on bidder collusion in experimental ascending price auctions without communication. We find that the strict bid improvement rule and private values are not always sufficient to break collusion among well-motivated bidders. Collusion still occurs as long as bidder gains from collusion are high. JEL classification code...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002